Distributed Reasoning in a Peer-to-Peer Setting: Application to the Semantic Web

In a peer-to-peer inference system, each peer can reason locally but can also solicit some of its acquaintances, which are peers sharing part of its vocabulary. In this paper, we consider peer-to-peer inference systems in which the local theory of each peer is a set of propositional clauses defined upon a local vocabulary. An important characteristic of peer-to-peer inference systems is that the global theory (the union of all peer theories) is not known (as opposed to partition-based reasoning systems). The main contribution of this paper is to provide the first consequence finding algorithm in a peer-to-peer setting: DeCA. It is anytime and computes consequences gradually from the solicited peer to peers that are more and more distant. We exhibit a sufficient condition on the acquaintance graph of the peer-to-peer inference system for guaranteeing the completeness of this algorithm. Another important contribution is to apply this general distributed reasoning setting to the setting of the Semantic Web through the Somewhere semantic peer-to-peer data management system. The last contribution of this paper is to provide an experimental analysis of the scalability of the peer-to-peer infrastructure that we propose, on large networks of 1000 peers

Toward a simulation approach for alkene ring-closing metathesis : scope and limitations of a model for RCM

A published model for revealing solvent effects on the ring-closing metathesis (RCM) reaction of di-Et diallylmalonate 7 has been evaluated over a wider range of conditions, to assess its suitability for new applications. Unfortunately, the model is too flexible and the published rate consts. do not agree with exptl. studies in the literature. However, by fixing the values of important rate consts. and restricting the concn. ranges studied, useful conclusions can be drawn about the relative rates of RCM of different substrates, precatalyst concn. can be simulated accurately and the effect of precatalyst loading can be anticipated. Progress has also been made toward applying the model to precatalyst evaluation, but further modifications to the model are necessary to achieve much broader aims

A predictive group-contribution framework for the thermodynamic modelling of CO absorption in cyclic amines, alkyl polyamines, alkanolamines and phase-change amines: New data and SAFT- Mie parameters

A significant effort is under way to identify improved solvents for carbon dioxide (CO ) capture by chemisorption. We develop a predictive framework that is applicable to aqueous solvent + CO mixtures containing cyclic amines, alkyl polyamines, and alkanolamines. A number of the mixtures studied exhibit liquid–liquid phase separation, a behaviour that has shown promise in reducing the energetic cost of CO capture. The proposed framework is based on the SAFT- Mie group-contribution (GC) approach, in which chemical reactions are described via physical association models that allow a simpler, implicit, treatment of the chemical speciation characteristic of these mixtures. We use previously optimized group interaction parameters between some amine groups and water (Perdomo et al., 2021), and develop new group interactions for the cNH, cN, NH2, NH, N, cCHNH, and cCHN groups with CO2; a set of second-order group parameters are also developed to account for proximity effects in some alkanolamines. A combination of literature data and new experimental measurements for the absorption of CO2 in aqueous cyclohexylamine systems obtained in our current work, are used to develop and test the proposed models. The SAFT- Mie GC approach is used to predict the thermodynamics of selected mixtures, including ternary phase diagrams and mixing properties relevant in the context of CO2 capture. The current work constitutes a substantial extension of the range of aqueous amine-based solvents that can be modelled and thus offers the most comprehensive thermodynamically consistent platform to date to screen novel candidate solvents for CO2 capture

Compact relaxations for polynomial programming problems

Reduced RLT constraints are a special class of Reformulation- Linearization Technique (RLT) constraints. They apply to nonconvex (both continuous and mixed-integer) quadratic programming problems subject to systems of linear equality constraints. We present an extension to the general case of polynomial programming problems and discuss the derived convex relaxation. We then show how to perform rRLT constraint generation so as to reduce the number of inequality constraints in the relaxation, thereby making it more compact and faster to solve. We present some computational results validating our approach

Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control

This paper presents a branch-and-lift algorithm for solving optimal control problems with smooth nonlinear dynamics and potentially nonconvex objective and constraint functionals to guaranteed global optimality. This algorithm features a direct sequential method and builds upon a generic, spatial branch-and-bound algorithm. A new operation, called lifting, is introduced, which refines the control parameterization via a Gram-Schmidt orthogonalization process, while simultaneously eliminating control subregions that are either infeasible or that provably cannot contain any global optima. Conditions are given under which the image of the control parameterization error in the state space contracts exponentially as the parameterization order is increased, thereby making the lifting operation efficient. A computational technique based on ellipsoidal calculus is also developed that satisfies these conditions. The practical applicability of branch-and-lift is illustrated in a numerical example. © 2013 Springer Science+Business Media New York

On the composition of convex envelopes for quadrilinear terms

International audienceWithin the framework of the spatial Branch-and-Bound algorithm for solving Mixed-Integer Nonlinear Programs, different convex relaxations can be obtained for multilinear terms by applying associativity in different ways. The two groupings ((x1x2)x3)x4 and (x1x2x3)x4 of a quadrilinear term, for example, give rise to two different convex relaxations. In [6] we prove that having fewer groupings of longer terms yields tighter convex relaxations. In this paper we give an alternative proof of the same fact and perform a computational study to assess the impact of the tightened convex relaxation in a spatial Branch-and-Bound setting